منابع مشابه
Abstract Simplicial Complexes
Simplicial Complexes Karol Pąk Institute of Computer Science University of Białystok Poland Summary. In this article we define the notion of abstract simplicial complexes and operations on them. We introduce the following basic notions: simplex, face, vertex, degree, skeleton, subdivision and substructure, and prove some of their properties. MML identifier: SIMPLEX0, version: 7.11.01 4.117.1046...
متن کاملRandom Abstract Simplicial Complexes Reduction
Random abstract simplicial complex representation provides a mathematical description of wireless networks and their topology. In order to reduce the energy consumption in this type of network, we intend to reduce the number of network nodes without modifying neither the connectivity nor the coverage of the network. In this paper, we present a reduction algorithm that lower the number of points...
متن کاملOn Helmholtz free energy for finite abstract simplicial complexes
We prove first that for the Barycentric refinement G1 of a finite abstract simplicial complexG, the Gauss-Bonnet formula χ(G) = ∑ xK (x) holds, where K(x) = (−1)(1−χ(S(x))) is the curvature of a vertex x with unit sphere S(x) in the graph G1. This curvature is dual toK −(x) = (−1) for which GaussBonnet is the definition of Euler characteristic χ(G). Because the connection Laplacian L′ = 1+A′ of...
متن کاملf - vectors of subdivided simplicial complexes ( extended abstract )
We take a geometric point of view on the recent result by Brenti and Welker, who showed that the roots of the f -polynomials of successive barycentric subdivisions of a finite simplicial complex X converge to fixed values dependinig only on the dimension of X . We show that these numbers are roots of a certain polynomial whose coefficients can be computed explicitely. We observe and prove an in...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2010
ISSN: 1898-9934,1426-2630
DOI: 10.2478/v10037-010-0013-y